Flat fragments of CTL and CTL: separating the expressive and distinguishing powers

Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers

Separating the Expressive and Distinguishing Powers

We study both the expressive and the distinguishing powers of flat temporal logics. These are fragments obtained by restricting the first argument of the Until operator to propositions. Both the linear and the braching-time cases are considered.

The Complexity of Satisfiability for Fragments of CTL and CTL

The satisfiability problems for CTL and CTL? are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that use less temporal or propositional operators, the complexity may decrease. This paper undertakes a systematic study of satisfiability for CTLand CTL?-formulae over restricted sets of propositional and temporal operator...

About the Expressive Power of CTL Combinators

We present a new and quite surprising result about the expressive power of the 3-U and V-U combinators in CTL.

On the Expressive Power of CTL

We show that the expressive power of the branching time logic CTL coincides with that of the class of bisimulation invariant properties expressible in so-called monadic path logic: monadic second order logic in which set quantification is restricted to paths. In order to prove this result, we first prove a new Composition Theorem for trees. This approach is adapted from the approach of Hafer an...